Examples of exceptional homomorphisms which have non-trivial Euler numbers
نویسندگان
چکیده
منابع مشابه
Quasidiagonal Extensions and Sequentially Trivial Asymptotic Homomorphisms
to be quasidiagonal when B⊗K contains an approximate unit of projections which is quasi-central in E, cf. [Sa]. He identified, under certain conditions, the subgroup of KK(A,B) which the quasidiagonal extensions correspond to under Kasparov’s isomorphism Ext(A,B) ' KK(A,B). C. Schochet has removed some of Salinas’ conditions in [S], the result being that when A is a unital C-algebra in the boot...
متن کاملGraph homomorphisms II: some examples
In this talk we will discuss some examples of graph homomorphisms. More precisely, the graph parameters which can be represented by counting the graph homomorphisms. The main reference is Section 2 in [2].
متن کاملSubcritical U-bootstrap Percolation Models Have Non-trivial Phase Transitions
We prove that there exist natural generalizations of the classical bootstrap percolation model on Z that have non-trivial critical probabilities, and moreover we characterize all homogeneous, local, monotone models with this property. Van Enter [28] (in the case d = r = 2) and Schonmann [25] (for all d > r > 2) proved that r-neighbour bootstrap percolation models have trivial critical probabili...
متن کاملOn Ideals Which Have the Weakly Insertion of Factors Property
A one-sided ideal of a ring has the insertion of factors property (or simply, IFP) if implies r for . We say a one-sided ideal of has the weakly IFP if for each , implies , for some non-negative integer . We give some examples of ideals which have the weakly IFP but have not the IFP. Connections between ideals of which have the IFP and related ideals of some ring extensions a...
متن کاملOn recognizing graphs by numbers of homomorphisms
Let Hom(G,H) be the number of homomorphisms from a graph G to a graph H. A well-known result of Lovász states that the function Hom(.,H) from all graphs uniquely determines the graph H upto isomorphism. We study this function restricted to smaller classes of graphs. We show that several natural classes (2-degenerated graphs and non-bipartite graphs with bounded chromatic number) are sufficient ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Topology
سال: 1991
ISSN: 0040-9383
DOI: 10.1016/0040-9383(91)90023-w